Little Knowledge Isn’t Always Dangerous—Understanding Water Distribution Networks Using Centrality Metrics
نویسندگان
چکیده
منابع مشابه
fault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Robustness and vulnerability assessment of water networks by use of centrality metrics
The reliability of a water distribution network (WDN) is a function of several time-invariant and time-dependent factors affecting its components and connectivity, most important of which have been shown to be the network's topology, its operating pressure, the type of key components (such as the diameter, length, material and age of water pipes) and the network's historical performance (such a...
متن کاملThe Least Cost Design of Water Distribution Networks Using Water Quality Constraints
Water quality is a very important issue related to people health, but it is not usually considered in water distribution networks (WDNs) design. In this paper, new constraints such as free residual chlorine and the quality performance index are incorporated into the least cost design of water distribution networks. EPANET2 was applied for the hydraulic and quality analysis of water distributio...
متن کاملEvaluating Centrality Metrics in Real-World Networks on GPU
GPGPU has received a lot of attention recently as a cost effective solution for high performance computing. In this paper we present a parallel algorithm for computing Betweenness centrality (BC) using CUDA. BC is an important metric in small world network analysis which is expensive to compute. While there are existing parallel implementations, ours is the first implementation on commodity har...
متن کاملCentrality metrics and localization in core-periphery networks
Two concepts of centrality have been defined in complex networks. The first considers the centrality of a node and many different metrics for it has been defined (e.g. eigenvector centrality, PageRank, non-backtracking centrality, etc). The second is related to a large scale organization of the network, the core-periphery structure, composed by a dense core plus an outlying and loosely-connecte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Emerging Topics in Computing
سال: 2014
ISSN: 2168-6750
DOI: 10.1109/tetc.2014.2304502